class Solution:
def xor(self, arr):
if len(arr)%2==0:
print("YES")
return
else:
last = arr[0]
for i in range(1, len(arr), 1):
if last>= arr[i]:
print("YES")
return
else:
last = arr[i]
print("NO")
t = int(input())
obj = Solution()
for _ in range(t):
a = int(input())
arr = list(map(int, input().split()))
obj.xor(arr)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
long long int m;
void precalculate()
{
;
}
void testcase()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
if(n%2==0)
{
cout<<"YES"<<endl;
return;
}
for(int i=0;i<n-1;i++)
if(a[i]>=a[i+1])
{
cout<<"YES"<<endl;
return;
}
cout<<"NO"<<endl;
}
int main()
{
precalculate();
int t;
cin>>t;
while(t-->0)
testcase();
return 0;
}281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |
734A - Anton and Danik | 1300B - Assigning to Classes |
1647A - Madoka and Math Dad | 710A - King Moves |
1131A - Sea Battle | 118A - String Task |
236A - Boy or Girl | 271A - Beautiful Year |
520B - Two Buttons | 231A - Team |
479C - Exams | 1030A - In Search of an Easy Problem |
158A - Next Round | 71A - Way Too Long Words |
160A - Twins | 1A - Theatre Square |
1614B - Divan and a New Project | 791A - Bear and Big Brother |
1452A - Robot Program | 344A - Magnets |